Pattern Structures and Their Morphisms

نویسندگان

  • Lars Lumpe
  • Stefan E. Schmidt
چکیده

Projections of pattern structures don’t always lead to pattern structures, however residual projections and o-projections do. As a unifying approach, we introduce the notion of pattern morphisms between pattern structures and provide a general sufficient condition for a homomorphic image of a pattern structure being again a pattern structure. In particular, we receive a better understanding of the theory of o-projections.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morphisms Between Pattern Structures and Their Impact on Concept Lattices

We provide a general framework for pattern structures by investigating adjunctions between posets and their morphisms. Our special interest is the impact of pattern morphisms on the induced concept lattices. In particular we are interested in conditions which are sufficient for the induced residuated maps to be injective, surjective or bijective. One application is that every representation con...

متن کامل

On morphisms of crossed polymodules

‎In this paper‎, ‎we prove that the category of crossed polymodules (i.e‎. ‎crossed modules of polygroups) and their morphisms is finitely complete‎. ‎We‎, ‎therefore‎, ‎generalize the group theoretical case of this completeness property of crossed modules‎.

متن کامل

From torsion theories to closure operators and factorization systems

Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].

متن کامل

Sorting Morphisms

Sorting algorithms can be classiied in many diierent ways. The way presented here is by expressing the algorithms as functional programs and to classify them by means of their recursion patterns. These patterns on their turn can be classiied as the natural recursion patterns that destruct or construct a given data-type, the so called cata-and anamorphisms respectively. We show that the selectio...

متن کامل

The category of generalized crossed modules

In the definition of a crossed module $(T,G,rho)$, the actions of the group $T$ and $G$ on themselves are given by conjugation. In this paper, we consider these actions to be arbitrary and thus generalize the concept of ordinary crossed module. Therefore, we get the category ${bf GCM}$, of all generalized crossed modules and generalized crossed module morphisms between them, and investigate som...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015